Chromodomain Ligand Optimization via Target-Class Directed Combinatorial Repurposing
نویسندگان
چکیده
منابع مشابه
Combinatorial ligand-directed lung targeting.
Phage display of random peptide libraries is a powerful, unbiased method frequently used to discover ligands for virtually any protein of interest and to reveal functional protein-protein interaction partners. Moreover, in vivo phage display permits selection of peptides that bind specifically to different vascular beds without any previous knowledge pertaining to the nature of their correspond...
متن کاملImproving and repurposing biocatalysts via directed evolution.
Over the last two decades, directed evolution has become a staple in protein engineering and ushered in a new era of industrial biocatalysis. Directed evolution has provided the tools to not only improve the activity of known biocatalysts, but also to endow biocatalysts with chemical reactivities not previously encountered in nature. Here we will discuss the recent successes in the quest to enh...
متن کاملCombinatorial Optimization Algorithms via Polymorphisms
An elegant characterization of the complexity of constraint satisfaction problems has emerged in the form of the the algebraic dichotomy conjecture of [BKJ00]. Roughly speaking, the characterization asserts that a CSP Λ is tractable if and only if there exist certain non-trivial operations known as polymorphisms to combine solutions to Λ to create new ones. In an entirely separate line of work,...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کامل6 ( b ) . Combinatorial Optimization via LPs
The flavor of a combinatorial optimization problem is to maximize an objective function over a set of valid points. In the case of TSP, the valid set of points S ⊆ {0, 1}( n 2) is the set of valid tours on the graph and the objective function is the minimum weight tour. In the cases that we will be interested in, the objective function will be linear. To make the problem amenable to linear prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACS Chemical Biology
سال: 2016
ISSN: 1554-8929,1554-8937
DOI: 10.1021/acschembio.6b00415